A Memory and Computation Efficient Sparse Level-Set Method
نویسندگان
چکیده
منابع مشابه
A Memory and Computation Efficient Sparse Level-Set Method
Since its introduction, the level set method has become the favorite technique for capturing and tracking moving interfaces, and found applications in a wide variety of scientific fields. In this paper we present efficient data structures and algorithms for tracking dynamic interfaces through the level set method. Several approaches which address both computational and memory requirements have ...
متن کاملMemory and Computation Efficient PCA via Very Sparse Random Projections
Algorithms that can efficiently recover principal components in very high-dimensional, streaming, and/or distributed data settings have become an important topic in the literature. In this paper, we propose an approach to principal component estimation that utilizes projections onto very sparse random vectors with Bernoulli-generated nonzero entries. Indeed, our approach is simultaneously effic...
متن کاملComputation of dendritic microstructures using a level set method
We compute time-dependent solutions of the sharp-interface model of dendritic solidification in two dimensions by using a level set method. The steady-state results are in agreement with solvability theory. Solutions obtained from the level set algorithm are compared with dendritic growth simulations performed using a phase-field model and the two methods are found to give equivalent results. F...
متن کاملEfficient computation of sparse structures
Basic graph structures such as maximal independent sets (MIS’s) have spurred much theoretical research in randomized and distributed algorithms, and have several applications in networking and distributed computing as well. However, the extant (distributed) algorithms for these problems do not necessarily guarantee fault-tolerance or load-balance properties. We propose and study “lowaverage deg...
متن کاملA BINARY LEVEL SET METHOD FOR STRUCTURAL TOPOLOGY OPTIMIZATION
This paper proposes an effective algorithm based on the level set method (LSM) to solve shape and topology optimization problems. Since the conventional LSM has several limitations, a binary level set method (BLSM) is used instead. In the BLSM, the level set function can only take 1 and -1 values at convergence. Thus, it is related to phase-field methods. We don’t need to solve the Hamilton-Jac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Scientific Computing
سال: 2010
ISSN: 0885-7474,1573-7691
DOI: 10.1007/s10915-010-9399-5